On summatory functions of additive functions and regular variation
نویسندگان
چکیده
منابع مشابه
On Summatory Functions of Additive Functions and Regular Variation
We shall denote the set of all regularly varying functions by R. We shall also denote by L the set of slowly slowly varying (or slowly oscillating) functions, namely those functions in R for which the index ρ = 0. It is easy to show that if h ∈ R, then there exists L ∈ L such that h(x) = xL(x), with ρ being the index of h. Slowly varying functions arise naturally in many branches of number theo...
متن کاملOn Summatory Totient Functions
The function F [kuφv, N ] has been the subject of intensive study for the last century and is classically known [2] for u ≤ 0, v = 1. The other results include u = 0, v = −1 [8], v = −u > 0 [4], [3] and references therein, v ≥ 0, u < −v − 1 [6], u = 1, v = −1 [10], [15], u = v = −1 [9], [17]. The leading and error terms for u = 0, v ∈ Z+, were calculated in [4] and [3], respectively. An extensi...
متن کاملstudy of hash functions based on chaotic maps
توابع درهم نقش بسیار مهم در سیستم های رمزنگاری و پروتکل های امنیتی دارند. در سیستم های رمزنگاری برای دستیابی به احراز درستی و اصالت داده دو روش مورد استفاده قرار می گیرند که عبارتند از توابع رمزنگاری کلیددار و توابع درهم ساز. توابع درهم ساز، توابعی هستند که هر متن با طول دلخواه را به دنباله ای با طول ثابت تبدیل می کنند. از جمله پرکاربردترین و معروف ترین توابع درهم می توان توابع درهم ساز md4, md...
Register Complexity of Additive Regular Functions
Additive Cost Register Automata (ACRA) map strings to integers using a finite set of registers that are updated using assignments of the form “x := y + c” at every step. The corresponding class of additive regular functions has multiple equivalent characterizations, appealing closure properties, and decidable analysis questions. In this paper, we define the register complexity of an additive re...
متن کاملDecision Problems for Additive Regular Functions
Additive Cost Register Automata (ACRA) map strings to integers using a finite set of registers that are updated using assignments of the form “x := y+ c” at every step. The corresponding class of additive regular functions has multiple equivalent characterizations, appealing closure properties, and a decidable equivalence problem. In this paper, we solve two decision problems for this model. Fi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Publications de l'Institut Mathematique
سال: 2002
ISSN: 0350-1302
DOI: 10.2298/pim0271027i